Search results for "network system"
showing 3 items of 3 documents
Dissipativity-Based Small-Gain Theorems for Stochastic Network Systems
2016
In this paper, some small-gain theorems are proposed for stochastic network systems which describe large-scale systems with interconnections, uncertainties and random disturbances. By the aid of conditional dissipativity and showing times of stochastic interval, small-gain conditions proposed for the deterministic case are extended to the stochastic case. When some design parameters are tunable in practice, we invaginate a simpler method to verify small-gain condition by selecting one subsystem as a monitor. Compared with the existing results, the existence-and-uniqueness of solution and ultimate uniform boundedness of input are removed from requirements of input-to-state stability and smal…
Stability of Positive Systems in WSN Gateway for IoT&IIoT
2020
Modern sensor networks work on the basis of intelligent sensors and actuators, their connection is carried out using conventional or specifically dedicated networks. The efficiency and smooth transmission of such a network is of great importance for the accuracy of measurements, sensor energy savings, or transmission speed. Ethernet in many networks is typically based on the TCP/IP protocol suite. Regardless of whether or not the network transmission is wired or wireless, it should always be reliable. TCP ensures transmission reliability through retransmissions, congestion control and flow control. But TPC is different in networks based on the UDP protocol. The most important here is the tr…
Distributed n-player approachability via time and space average consensus
2012
Abstract In this paper we consider repeated coalitional games with transferable utilities (TU) over networks. Namely, we consider a set of n players that have to distribute among themselves a vector of rewards (one for each player). In our network version there is no coordinator allocating the rewards, but the agents have to agree on a common time-averaged vector by updating the local estimates of the reward vector. The common time-averaged reward vector has to approach a suitable constraint set, called core of the game, that guarantees that no agents benefit from quitting the grand coalition. We propose a doubly (over time and space) averaging distributed algorithm. At every iteration, eac…